Optimal and Approximate Solutions of Object Functions for Base Station Location Problem
نویسندگان
چکیده
منابع مشابه
Tabu Search Heuristic for Competitive Base Station Location Problem
We consider the following location problem. New 5G networks are deployed by two competitive operators (called resp. O1 and O2), which we refer to as a leader and a follower due to their sequential entering the market. They compete to serve clients by installing and configuring base stations (BS). We assume that the leader had already made a decision and operating a 5G network. Follower arrives ...
متن کاملMore about base station location games
This paper addresses the problem of locating base stations in a certain area which is highly populated by mobile stations; each mobile station is assumed to select the closest base station. Base stations are modeled by players who choose their best location for maximizing their uplink throughput. The approach of this paper is to make some simplifying assumptions in order to get interpretable an...
متن کاملExperimental Analysis of Local Search Algorithms for Optimal Base Station Location
Search techniques such as Genetic Algorithms, Simulated Annealing, Tabu Search and Random Walk Algorithms have been used extensively for global optimization. This paper presents an experimental analysis of the performance of these algorithms for the problem of selecting the optimal location of base stations in a mobile communication system. The effect of varying the value of important parameter...
متن کاملOptimal Location for a Mobile Base Station in a Complex Network
The focus of this work is the development of a complete network architecture to enhance telemetry performance using a mobile base station (MBS). Existing telemetry standards employ a radio frequency (RF) link standard, which allows only unidirectional data transfer from a test article (TA) to a ground station over a dedicated channel per TA. This limits the capacity of the system, as resources ...
متن کاملCharacteristics of Optimal Solutions to the Sensor Location Problem
In Bianco et al. (2001), the authors present the Sensor Location Problem: that of locating the minimum number of traffic sensors at intersections of a road network such that the traffic flow on the entire network can be determined. They offer a necessary and sufficient condition on the set of monitored nodes in order for the flow everywhere to be determined. In this paper, we present a countere...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The KIPS Transactions:PartC
سال: 2007
ISSN: 1598-2858
DOI: 10.3745/kipstc.2007.14-c.2.179